A New Performance Measure for Scheduling Independent Real-Time Tasks

A New Performance Measure for Scheduling Independent Real-Time Tasks

Scheduling Real Time Tasks: A Performance Study

This paper describesa performance study of a number of task schedulingalgorithms conventionally used in the design of distributed real-time systems. That study, based on a simulation model, allows one to asses the adequacy of those algorithmswith respect to different parameters that can characterize the distributed system load and its communication costs. 1. An earlier version of this work appe...

A New Scheduling Algorithms For Real Time Tasks

The main objective of this paper is to develop the two different ways in which round robin architecture is modified and made suitable to be implemented in real time and embedded systems. The scheduling algorithms plays a significant role in the design of real time embedded systems. Simple round robin architecture is not efficient to be implemented in embedded systems because of higher context s...

Scheduling Real-Time Tasks for Dependability

Real-time systems are increasingly used in applications whose failure may result in large economic and human costs. Since many of the systems operate in environments that are non-deterministic, and even hazardous, it is extremely important that the systems must be dependable, i.e., the deadlines of tasks must be met even in the presence of certain failures. In order to enhance the dependability...

A Real-Time Scheduling Algorithm for Soft Periodic Tasks

Since now, some scheduling algorithms have been presented to guarantee the time constraints of soft real-time tasks, but most of them have some drawbacks. The first drawback of them is that scheduling decisions are based on parameters which are assumed to be crisp; however, in many environments the values of these parameters are uncertain. The second one is the high time complexity of these met...